Exact Algorithms for Intervalizing Colored Graphs
نویسندگان
چکیده
In the Intervalizing Colored Graphs problem, one must decide for a given graph G = (V,E) with a proper vertex coloring of G whether G is the subgraph of a properly colored interval graph. For the case that the number of colors k is xed, we give an exact algorithm that uses O∗(2n/log (n)) time for all > 0. We also give an O∗(2n) algorithm for the case that the number of colors k is not xed.
منابع مشابه
The hardness of intervalizing four colored caterpillars
The problem of Intervalizing Colored Graphs (ICG) has received a lot of attention due to their use as a model for DNA physical mapping with ambiguous data. If k is the number of colors, the problem is known to be NP-Complete for general graphs for k 4 and has polynomial time algorithms for k = 2 and k = 3. In this paper we show that the ICG problem is NP-complete when the graph is a caterpillar...
متن کاملThe hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs
In this paper, we consider the complexity of a number of combinatorial problems; namely, Intervalizing Colored Graphs (DNA physical mapping), Trian-gulating Colored Graphs (perfect phylogeny), (Directed) (Modified) Colored Cutwidth, Feasible Register Assignment and Module Allocation for graphs of bounded pathwidth. Each of these problems has as a characteristic a uniform upper bound on the tree...
متن کاملThe Hardness of Problems on Thin Colored Graphs
In this paper, we consider the complexity of a number of combinatorial problems; namely, Intervalizing Colored Graphs (DNA physical mapping), Triangulating Colored Graphs (perfect phylogeny), (Directed) (Modified) Colored Cutwidth, Feasible Register Assignment and Module Allocation for graphs of bounded treewidth. Each of these problems has as a characteristic a uniform upper bound on the tree ...
متن کاملThe hardness of perfect phylogeny , feasible register assignment and other problems on thin colored graphs ( Hans
In this paper, we consider the complexity of a number of combinatorial problems; namely, INTERVALIZING COLORED GRAPHS (DNA PHYSICAL MAPPING), TRIANGULATING COLORED GRAPHS (PERFECT PHYLOGENY), (DIRECTED) (MODIFIED) COLORED CUTWIDTH, FEASIBLE REGISTER ASSIGNMENT and MODULE ALLOCATION FOR GRAPHS OF BOUNDED PATHWIDTH. Each of these problems has as a characteristic a uniform upper bound on the tree ...
متن کاملOn Intervalizing K-colored Graphs for DNA Physical Mapping
The problem to determine whether a given k-colored graph is a subgraph of a properly colored interval graph has an application in DNA physical mapping. In this paper, we study the problem for the case that the number of colors k is xed. For k = 2, we give a simple linear time algorithm, for k = 3, we give an O(n) algorithm for biconnected graphs with n vertices, and for k = 4, we show that the ...
متن کامل